Assignment strategy for proteins with known structure.
نویسندگان
چکیده
In protein NMR the assignment of nuclear spin resonances is a prerequisite for all subsequent applications, such as studies of ligand binding, protein-DNA interactions, and dynamics. Resonance assignment is a time consuming step even when the 3D x-ray structure of the protein is available. A new strategy is presented to solve the "inverse" assignment problem, which is the determination of the NMR resonance assignment from a known 3D protein structure. The protocol employs NMR data in the form of residual dipolar couplings and chemical shifts, while it does not require any sequential NMR connectivity information. The assignment problem is mathematically formulated in terms of a weighted matching problem that can be computationally efficiently solved by a combinatorial optimization algorithm. The protocol is applied to ubiquitin using two or three residual dipolar couplings per amino acid measured in Pfl phage medium together with chemical shift information. The algorithm yields for more than 90% of the protein backbone resonances the correct assignment.
منابع مشابه
Helix Segment Assignment in Proteins Using Fuzzy Logic
The automatic assignment of protein secondary structure from three dimensional coordinates is an essential step in the characterization of protein structure. <span style="font...
متن کاملNOEnet–Use of NOE networks for NMR resonance assignment of proteins with known 3D structure
MOTIVATION A prerequisite for any protein study by NMR is the assignment of the resonances from the (15)N-(1)H HSQC spectrum to their corresponding atoms of the protein backbone. Usually, this assignment is obtained by analyzing triple resonance NMR experiments. An alternative assignment strategy exploits the information given by an already available 3D structure of the same or a homologous pro...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملAutomated backbone assignment of labeled proteins using the threshold accepting algorithm.
The sequential assignment of backbone resonances is the first step in the structure determination of proteins by heteronuclear NMR. For larger proteins, an assignment strategy based on proton side-chain information is no longer suitable for the use in an automated procedure. Our program PASTA (Protein ASsignment by Threshold Accepting) is therefore designed to partially or fully automate the se...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of magnetic resonance
دوره 157 1 شماره
صفحات -
تاریخ انتشار 2002